Generalized P-ary Sequences with Two-level Autocorrelation
نویسندگان
چکیده
In this paper, we find a family of -ary sequences with ideal two-level autocorrelation with symbols in the finite field . The proposed family may be considered as a generalization of the well-known nonbinary sequences introduced by Helleseth and Gong. Using the constructed sequences and -sequences, we present a family of -ary sequences of which the correlation property is optimal in terms of the Welch lower bound.
منابع مشابه
On a Connection between Ideal Two-level Autocorrelation and Almost Balancedness of $p$-ary Sequences
In this correspondence, for every periodic p−ary sequence satisfying ideal two-level autocorrelation property the existence of an element of the field GF(p) which appears one time less than all the rest that are equally distributed in a period of that sequence, is proved by algebraic method. In addition, it is shown that such a special element might not be only the zero element but as well arbi...
متن کاملP-ary Unified Sequences: P-ary Extended D-form Sequences with the Ideal Autocorrelation Property
In this paper, for a prime number , a construction method to generate -ary -form sequences with the ideal autocorrelation property is proposed and using the ternary sequences found by Helleseth, Kumar, and Martinsen, ternary -form sequences with the ideal autocorrelation property are constructed. By combining the methods for generating -ary extended sequences (a special case of geometric sequen...
متن کاملTwo-tuple balance of non-binary sequences with ideal two-level autocorrelation
Let p be a prime, q = pm and Fq be the finite field with q elements. In this paper, we will consider q-ary sequences of period qn − 1 for q > 2 and study their various balance properties: symbol-balance, difference-balance, and two-tuple-balance properties. The array structure of the sequences is introduced, and various implications between these balance properties and the array structure are p...
متن کاملAutocorrelation and Lower Bound on the 2-Adic Complexity of LSB Sequence of p-ary m-Sequence
In modern stream cipher, there are many algorithms, such as ZUC, LTE encryption algorithm and LTE integrity algorithm, using bit-component sequences of p-ary m-sequences as the input of the algorithm. Therefore, analyzing their statistical property (For example, autocorrelation, linear complexity and 2-adic complexity) of bit-component sequences of p-ary m-sequences is becoming an important res...
متن کاملAlmost p-Ary Perfect Sequences
A sequence a = (a0, a1, a2, · · · , an) is said to be an almost p-ary sequence of period n + 1 if a0 = 0 and ai = ζ bi p for 1 ≤ i ≤ n, where ζp is a primitive p-th root of unity and bi ∈ {0, 1, · · · , p − 1}. Such a sequence a is called perfect if all its out-of-phase autocorrelation coefficients are zero; and is called nearly perfect if its out-of-phase autocorrelation coefficients are all 1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013